package com.leetcode;

/**
 * @author luoyulin
 * @create 2021-12-26 23:40
 **/
public class Solution {
    public ListNode reverseKGroup(ListNode head,int k){
        ListNode res = new ListNode();
        return res;
    }
}

class ListNode{
    public int val;
    public ListNode next;

    public ListNode(){}

    public ListNode(int val) {
        this.val = val;
    }
    public ListNode(int val, ListNode next) {
        this.val = val;
        this.next = next;
    }
}
